Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
نویسنده
چکیده
We prove “untyping” theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to the typed settings. Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms.
منابع مشابه
Untyping Typed Algebras and Colouring Cyclic Linear Logic
We prove “untyping” theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to the typed settings. Some of these theorems are obtained via a detour through fragments of cyclic li...
متن کاملUntyping Typed Algebraic Structures
Algebraic structures sometimes need to be typed. For example, matrices over a ring form a ring, but the product is a only a partial operation: dimensions have to agree. Therefore, an easy way to look at matrices algebraically is to consider “typed rings”. We prove some “untyping” theorems: in some algebras (semirings, Kleene algebras, residuated monoids), types can be reconstructed from valid u...
متن کاملProof Nets in Process Algebraic Form
We present δ-calculus, a computational interpretation of Linear Logic, in the form of a typed process algebra whose structures correspond to Proof Nets, and where typing derivations correspond to linear sequent proofs. Term reduction shares the properties of cut elimination in the logic, and immediately we can obtain a number of inherited qualities, among which are termination, deadlock-freedom...
متن کاملAn exact correspondence between a typed pi-calculus and polarised proof-nets
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed π-calculus based on IO-typing. The respective incremental constraints, one on geometric structures of proof-nets and one based on types, precisely correspond to each other, leading to the exact correspondence of the respective formalisms as they appear in [Lau03] (for proof-nets) and [H...
متن کاملConstructive Logics Part II: Linear Logic and Proof Nets
The purpose of this paper is to give an exposition of material dealing with constructive logics, typed -calculi, and linear logic. The first part of this paper gives an exposition of background material (with the exception of the Girard-translation of classical logic into intuitionistic logic, which is new). This second part is devoted to linear logic and proof nets. Particular attention is giv...
متن کامل